A Hybrid Approach to Schema and Data Integration for Meta-search Engines

نویسندگان

  • Tabbasum Naz
  • Jürgen Dorn
  • Alexandra Poulovassilis
چکیده

In this paper, we describe an approach to schema and data integration for meta-search engines. The integration of heterogeneous, distributed information from the Web is a complicated task, especially the task of schema/data matching and integration. During the matching and integration process, we need to handle syntactic, semantic and structural heterogeneity between multiple information sources. In this paper, our main objective is to resolve semantic conflicts. The data, ontology and information integration communities face similar types of problems, and we leverage techniques developed by these communities. Our approach is a hybrid one, in that we use multiple matching criteria and multiple matchers. We employ several elementlevel, structure-level and ontology-based techniques during the integration process. A domain ontology serves as a global ontology and allows us to resolve semantic heterogeneity. Our matching process handles different mapping cardinalities (1:1, 1:n, n:1, m:n). The mappings derived are used to generate an integrated meta-search query interface, to support query processing in the meta-search engine, and to resolve semantic conflicts arising during result extraction from the source search engines. Experiments conducted in the job search domain show that the cumulative use of element-level, structurelevel and ontology-based techniques increases the correctness of matching during the automatic integration of source search interfaces.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

A New Hybrid Method for Web Pages Ranking in Search Engines

There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...

متن کامل

A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

متن کامل

A Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design

This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...

متن کامل

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009